Quantum computing for classical problems: variational quantum eigensolver for activated processes

نویسندگان

چکیده

Abstract The theory of stochastic processes impacts both physical and social sciences. At the molecular scale, dynamics is ubiquitous because thermal fluctuations. Fokker–Plank–Smoluchowski equation models time evolution probability density selected degrees freedom in diffusive regime it is, therefore, a workhorse chemistry. In this paper we report on development implementation variational quantum eigensolver to solve Fokker–Planck–Smoluchowski eigenvalue problem. We show that such an algorithm, typically adopted address chemistry problems, can be effectively applied classical systems, paving way new applications computers. compute conformational transition rate linear chain rotors with nearest-neighbour interactions. provide method encode distribution for given conformation computer assess its scalability terms operations. A performance analysis noisy emulators devices (IBMQ Santiago) provided small which shows results good agreement benchmark without any further addition error mitigation techniques.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Variational Principle for Mixed Classical-quantum Systems

An extended variational principle providing the equations of motion for a system consisting of interacting classical, quasiclassical and quantum components is presented, and applied to the model of bilinear coupling. The relevant dynamical variables are expressed in the form of a quantum state vector which includes the action of the classical subsystem in its phase factor. It is shown that the ...

متن کامل

An Axiomatization for Quantum Processes to Unifying Quantum and Classical Computing

We establish an axiomatization for quantum processes, which is a quantum generalization of process algebra ACP (Algebra of Communicating Processes). We use the framework of a quantum process configuration 〈p, %〉, but we treat it as two relative independent part: the structural part p and the quantum part %, because the establishment of a sound and complete theory is dependent on the structural ...

متن کامل

Quantum vertex model for reversible classical computing

Mappings of classical computation onto statistical mechanics models have led to remarkable successes in addressing some complex computational problems. However, such mappings display thermodynamic phase transitions that may prevent reaching solution even for easy problems known to be solvable in polynomial time. Here we map universal reversible classical computations onto a planar vertex model ...

متن کامل

Quantum computing classical physics.

In the past decade, quantum algorithms have been found which outperform the best classical solutions known for certain classical problems as well as the best classical methods known for simulation of certain quantum systems. This suggests that they may also speed up the simulation of some classical systems. I describe one class of discrete quantum algorithms which do so--quantum lattice-gas aut...

متن کامل

Classical and Quantum Problems for Quanputers

Quantum computers are considered as a part of the family of the reversible , lineary-extended, dynamical systems (Quanputers). For classical problems an operational reformulation is given. A universal algorithm for the solving of classical and quantum problems on quanputers is formulated. 1. Time-reversible classical discrete dynamical systems (computers) and corresponding (quantum) extraparts ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: New Journal of Physics

سال: 2021

ISSN: ['1367-2630']

DOI: https://doi.org/10.1088/1367-2630/ac3ff9